Pii: S0360-8352(98)00106-5

نویسندگان

  • Tiam-Hock Eng
  • Zhi-Kui Ling
  • Walter Olson
  • Chuck McLean
چکیده

A feature-based model is proposed for assembly sequence planning automation. The fundamental assembly modeling strategy for a product is based on the mating features of its components. The objectives of this study are to integrate assembly planning of a product with its CAD model, generate a correct and practical assembly sequence and establish a software system to carry out the planning process. A disassembly approach in assembly planning is used in this study. The degree of freedom information between two mating features is used to characterize their kinematic conditions. Boolean operations of the degrees of freedom on all features of a component provides its local degree of freedom, which is used to set up the functional precedence relation. In some cases, where the functional precedence relation cannot be detected by geometric reasoning, clipping of the known `common sense' relation is applied by a user. A bounding box checking approach is used to ensure no global collision during assembly. Furthermore, a set of criteria based on assembly feasibility, manipulability, assembly direction, cost and stability is used to choose a good assembly sequence. # 1999 Published by Elsevier Science Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pii: S0360-8352(98)00105-3

ÐWe consider the problem of scheduling n identical jobs with unequal ready times on m parallel uniform machines to minimize the maximum lateness. This paper develops a branch-and-bound procedure that optimally solves the problem and introduces six simple single-pass heuristic procedures that approximate the optimal solution. The branch-and-bound procedure uses the heuristics to establish an ini...

متن کامل

Pii: S0360-8352(98)00110-7

A critical problem in decision analysis is how to evaluate the di€erence between two or more di€erent rankings of a set of alternatives. In this paper it is assumed that a group of decision makers has already established a ranking for each one of a set of alternatives. Then, the problem examined here is how to evaluate the di€erences among these rankings. This problem does not have a unique sol...

متن کامل

A hybrid approach to the single line scheduling problem with multiple products and sequence-dependent time

The present paper presents a hybrid approach for solving manufacturing scheduling problems, based on the integration between Constraint Logic Programming (CLP) and Genetic Algorithm (GA) approaches. The proposed methodology is applied to a single line with multiple products and sequence-dependent time. This system model derives from a real case of a company producing sheets for catalytic conver...

متن کامل

Pii: S0360-8352(99)00086-8

In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows. Our neighborhood construction focuses on the relationship between route(s) and node(s). Unlike the conventional methods for parallel route construction, we construct mutes in a nested parallel manner to obtain higher solution quality. Computational r...

متن کامل

Pii: S0360-8352(02)00181-x

We consider the problem of scheduling a number of jobs on a single machine against a restrictive common due date. The paper consists of two parts: firstly a new and appropriate problem representation is developed. As the restrictive common due date problem is known to be intractable we decided, secondly, to apply meta-heuristics, namely evolutionary strategies, simulated annealing and threshold...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999